A monotone approximation algorithm for scheduling with precedence constraints
نویسندگان
چکیده
منابع مشابه
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m)-approximation algorithm for scheduling related machines with precedence constraints.
متن کاملAn improved monotone algorithm for scheduling related machines with precedence constraints
We answer an open question posed by Krumke, Schwahn, van Stee and Westphal by showing how to turn the algorithm by Chekuri and Bender for scheduling related machines with precedence constraints into a O(logm)-approximation algorithm that is monotone in expectation. This significantly improves on the previously best known monotone approximation algorithms for this problem, by Krumke et al. and T...
متن کاملApproximation Algorithms for Scheduling Jobs with Chain Precedence Constraints
The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...
متن کاملApproximation Algorithms for Stochastic Machine Scheduling with Precedence Constraints
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time ∑w j C j , where w j 0. Building upon a linear programming relaxation by Möhring, Schulz, and ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.05.003